The additive index of polynomials over finite fields
نویسندگان
چکیده
In this paper we introduce the additive analogue of index a polynomial over finite fields. We show that every P ( x ) ∈ F q [ ] can be expressed uniquely in its form such = f L + M where , are p -linearized polynomials deg < splits completely and is maximal degree. As applications, study several problems theory fields terms their indices, as value set sizes, bounds on multiplicative character sums, characterization permutation polynomials.
منابع مشابه
Additive Polynomials over Perfect Fields
where aij ∈ K. Additive polynomials over valued fields in positive characteristic play an important role in understanding many algebraic and model theoretic properties of maximal fields of positive characteristic, see [7] for a thorough examination of the issue. A subset S of a valued field (K, v) has the optimal approximation property if for all a ∈ K, the set {v(s − a) : s ∈ S} has a maximal ...
متن کاملIndex bounds for character sums of polynomials over finite fields
Abstract. We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings of small indices. As an application, we also give some general bounds for numbers of solutions of some Artin-Schreier equations and mininum weight...
متن کاملIrreducible Polynomials over Finite Fields
As we will see, modular arithmetic aids in testing the irreducibility of polynomials and even in completely factoring polynomials in Z[x]. If we expect a polynomial f(x) is irreducible, for example, it is not unreasonable to try to find a prime p such that f(x) is irreducible modulo p. If we can find such a prime p and p does not divide the leading coefficient of f(x), then f(x) is irreducible ...
متن کاملSettled Polynomials over Finite Fields
We study the factorization into irreducibles of iterates of a quadratic polynomial f over a finite field. We call f settled when the factorization of its nth iterate for large n is dominated by “stable” polynomials, namely those that are irreducible under post-composition by any iterate of f . We prove that stable polynomials may be detected by their action on the critical orbit of f , and that...
متن کاملSearch of Primitive Polynomials over Finite Fields
Let us introduce some notations and definitions: if p denotes a prime integer and n a positive integer, then GF(p”) is the field containing pn elements. a primitive element of GF(p”) is a generator of the cyclic multiplicative group GVP”)*, a manic irreducible polynomial of degree n belonging to GF(p)[X] is called primitive if its roots are primitive elements of GF(p”). These polynomials are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2022
ISSN: ['1090-2465', '1071-5797']
DOI: https://doi.org/10.1016/j.ffa.2022.102002